#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair< int,int > pii;

int inline read(){
    int x = 0,f = 1;char c = getchar();
    while(!isdigit(c)){if(c == '-')f = -1;c=getchar();}
    while(isdigit(c)){x = x * 10 + c - '0';c=getchar();}
    return x*f;
}
struct node{
    int s;
    bool gj=0,d=0;
}a[100005];

bool inline cmp(node x,node y){
    return x.s < y.s;
}

signed main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n = read();
    for(int i = 1;i <= n;i++)a[i].s = read();
    sort(a+1,a+n+1,cmp);
    int sum = n;
    for(int i = n;i > 1;i--){
        if(a[i].d || a[i].gj)continue;
        int ss = i-1;
        while(a[i].s <= a[ss].s && ss > 0)ss--;
        if(a[i].s <= a[ss].s)continue;
        sum--;
        a[ss].d = 1;
        a[i].gj = 1;
    }
    cout << sum;
    return 0;
}
